منابع مشابه
Parallel Integral Curves
Understanding vector fields resulting from large scientific simulations is an important and often difficult task. Integral curves, curves that are tangential to a vector field at each point, are a powerful visualization method in this context. Application of integral curve-based visualization to very large vector field data represents a significant challenge due to the non-local and data-depend...
متن کاملSpin Curves over Non-stable Curves
Here we consider degenerations of stable spin curves for a fixed smoothing of a non-stable curve: we are able to give enumerative results and a description of limits of stable spin curves. We give a geometrically meaningful definition of spin curves over non-stable curves.
متن کاملGeometric Modeling of Parallel Curves on Surfaces
This paper is concerned with various aspects of the modeling of parallel curves on surfaces with special emphasis on surfaces of revolution. An algorithm for efficient tracking of the geodesics on these surfaces is presented. Existing methods for plane offset curves are adapted to generate G-spline approximations of parallel curves on arbitrary surfaces. An algorithm to determine singularities ...
متن کاملdetermination of maximal singularity free zones in the workspace of parallel manipulator
due to the limiting workspace of parallel manipulator and regarding to finding the trajectory planning of singularity free at workspace is difficult, so finding a best solution that can develop a technique to determine the singularity-free zones in the workspace of parallel manipulators is highly important. in this thesis a simple and new technique are presented to determine the maximal singula...
15 صفحه اولParallel Algorithm for Multiplication on Elliptic Curves
Given a positive integer n and a point P on an elliptic curve E, the computation of nP , that is, the result of adding n times the point P to itself, called the scalar multiplication, is the central operation of elliptic curve cryptosystems. We present an algorithm that, using p processors, can compute nP in time O(log n+H(n)=p+ log p), where H(n) is the Hamming weight of n. Furthermore, if thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Immunological Methods
سال: 1988
ISSN: 0022-1759
DOI: 10.1016/0022-1759(88)90059-2